Short and long training fields

ABSTRACT

A method includes receiving a first plurality of symbols comprising complex portions. The method further includes applying conjugate symmetry to the first plurality of symbols, producing a second plurality of symbols comprising no complex portions. The method further includes transforming the second plurality of symbols using an inverse fast Fourier transform, producing a third plurality of symbols. The method further includes interpolating the third plurality of symbols, generating a short training field comprising at least one real portion of the third plurality of symbols, generating a long training field comprising at least one real portion of the third plurality of symbols, and transmitting the short training field and long training field in a WPAN.

CROSS-REFERENCE TO RELATED APPLICATION

The present application claims priority to U.S. Provisional Patent Application No. 61/238,445, filed on Aug. 31, 2009; and U.S. Provisional Patent Application No. 61/287,586, filed on Dec. 17, 2009; all of which are hereby incorporated herein by reference.

BACKGROUND

Wireless personal area networks (“WPANs”) are used to convey information over relatively short distances. Unlike wireless local area networks (“WLANs”), WPANs ineed little or no infrastructure, and WPANS allow small, power-efficient, and inexpensive solutions to be implemented for a wide range of devices. Smart Utility Networks (“SUNs”) may operate either over short ranges such as in a mesh network where utility meter information is sent from one utility meter to another or over longer ranges such as in a star topology where utility meter information is sent to a poletop collection point. The terms WPAN and SUN are used interchangeably in this document.

SUMMARY

System and methods for generating short and long training fields for smart utility networks are described herein. In at least some disclosed embodiments, a method includes receiving a first plurality of symbols comprising real portions and complex portions. The method further includes applying conjugate symmetry to the first plurality of symbols, thus producing a second plurality of symbols comprising real portions and no complex portions. The method further includes transforming the second plurality of symbols using an inverse fast Fourier transform, thus producing a third plurality of symbols. The method further includes interpolating the third plurality of symbols, generating a short training field comprising at least one real portion of the third plurality of symbols, generating a long training field comprising at least one real portion of the third plurality of symbols, and transmitting the short training field and long training field in a WPAN.

In other disclosed embodiments, a device includes a processor, a memory coupled to the processor, and an antenna coupled to the processor. The processor generates a packet for use in a WPAN comprising a short training field as part of a synchronization header and a long training field as part of the synchronization header.

In yet other disclosed embodiments, a machine-readable storage medium includes executable instructions that, when executed, cause one or more processors to generate a packet for use in a WPAN comprising a short training field as part of a synchronization header and a long training field as part of the synchronization header.

These and other features and advantages will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings and claims.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present disclosure, reference is now made to the accompanying drawings and detailed description, wherein like reference numerals represent like parts:

FIG. 1 compares peak-to-average power ratios (PAR) in decibels between various sequences of short training fields (“STFs”) and long training fields (“LTFs”) in accordance with various embodiments;

FIG. 2 illustrates an embodiment of a packet containing a STF and LTF in accordance with various embodiments;

FIGS. 3A-3J illustrate the frequency domain representations of embodiments of STFs and LTFs generated with different inverse fast Fourier transform settings in accordance with various embodiments;

FIG. 4 illustrates generation of STFs and LTFs via modules in accordance with various embodiments;

FIG. 5 illustrations generation of STFs via modules in accordance with various embodiments;

FIG. 6 illustrates negation of last STF to enable boundary detection in accordance with various embodiments;

FIG. 7 illustrates a method of generating STFs and LTFs in accordance with various embodiments; and

FIG. 8 illustrates a particular machine suitable for implementing one or more embodiments described herein.

NOTATION AND NOMENCLATURE

Certain terms are used throughout the following claims and description to refer to particular components. As one skilled in the art will appreciate, different entities may refer to a component by different names. This document does not intend to distinguish between components that differ in name but not function. In the following discussion and in the claims, the terms “including” and “comprising” are used in an open-ended fashion, and thus should be interpreted to mean “including, but not limited to . . . ” Also, the term “couple” or “couples” is intended to mean an optical, wireless, indirect electrical, or direct electrical connection. Thus, if a first device couples to a second device, that connection may be through an indirect electrical connection via other devices and connections, through a direct optical connection, etc. Additionally, the term “system” refers to a collection of two or more hardware components, and may be used to refer to an electronic device.

DETAILED DESCRIPTION

The following discussion is directed to various embodiments of the invention. Although one or more of these embodiments may be preferred, the embodiments disclosed should not be interpreted, or otherwise used, as limiting the scope of the disclosure, including the claims, unless otherwise specified. In addition, one having ordinary skill in the art will understand that the following description has broad application, and the discussion of any embodiment is meant only to be exemplary of that embodiment, and not intended to intimate that the scope of the disclosure, including the claims, is limited to that embodiment.

A WPAN or low-rate WPAN is a simple, low-cost communication network that allows wireless connectivity in applications with limited power and relaxed throughput requirements. The main objectives of a WPAN are ease of installation, reliable data transfer, short-range operation, extremely low cost, reasonable battery life, and a simple and flexible protocol.

Some characteristics of a WPAN are:

-   -   Over-the-air data rates of 250 kb/s, 100 kb/s, 40 kb/s, and 20         kb/s     -   Star or peer-to-peer operation     -   Allocated 16-bit short or 64-bit extended addresses     -   Optional allocation of guaranteed time slots     -   Carrier sense multiple access with collision avoidance channel         access     -   Low power consumption     -   Energy detection     -   Link quality indication     -   16 channels in the 2450 MHz band, 30 channels in the 915 MHz         band, and 3 channels in the 868 MHz band.         These characteristics are not requirements, and each WPAN may         deviate from the characteristics in numerous ways. Two different         device types can participate in a WPAN: a full-function device         (“FFD”) and a reduced-function device (“RFD”). The FFD can         operate in three modes serving as a personal area network         (“PAN”) coordinator or a device. A FFD can talk to RFDs or other         FFDs while a RFD can talk only to a FFD. More information can be         found at IEEE Std. 802.15.4-2006 available at         http://www.ieee802.org/15/pub/TG4.html and hereby incorporated         by reference.

A utility network or smart utility network (“SUN”) is a low-rate (e.g., 40 kbps to 1 Mbps) low-power WPAN that is specifically designed for use in utility metering applications such as transmitting electric, gas, water usage, and other like data from the customer premises to a data collection point operated by the utility. For example, utility meters are installed for each house in a residential neighborhood, and the usage data is sent periodically from each utility meter to a data collection point, which is an element of the WPAN. The data collection point is connected by fiber, copper wire, or wireless connection to a central office that collects all the usage data for a region. Usage data is sent either directly from each utility meter to the collection point or from utility meter to utility meter until the collection point is reached in a star or network formation, respectively.

This disclosure describes preamble sequences for use in WPAN packets that include a short training field (“STF”) and/or a long training field (“LTF”) for the orthogonal frequency division multiplexing (“OFDM”) physical layer (“PHY”). A STF and LTF are a number of bits in a packet, appearing consecutively in a preamble of the packet in at least one embodiment. In at least one embodiment, the STF has about one quarter the number of non-zero tones as compared to the LTF in order to generate a 4× repetition within the IFFT length. The STF is used by the receiver for automatic gain control settling, packet/boundary detection and/or coarse frequency offset estimation as discussed herein. The LTF is used for fine frequency offset estimation, FFT placement, integer frequency offset estimation, and/or channel estimation as discussed herein. Applicability is not limited to SUNs; rather, the teachings herein may apply to any wireless communication system. In other embodiments, the amount and repetition of the STFs and LTFs vary, and the repetitions may or may not include the cyclic prefix. In the WPAN packets, there are two or more STF OFDM symbols followed by multiple LTF OFDM symbols, the packet header, and the packet payload in at least one embodiment. In other embodiments, the type, order, and number of packet elements vary.

Table 1 illustrates the MCS levels for the 5 options for OFDM block size. Option 1 is generated with a 128 point IFFT, Option 2 is generated with a 64 point IFFT, and Options 3, 4, and 5 use 32, 16, and 8 point IFFTs, respectively.

TABLE 1 Modulation and Coding Schemes for 5 IFFT Sizes Number of Data Sub-Carriers (NDSC) Option 1 2 3 4 5 100 48 22 12 4 MCS NCBPS NDBPS NCBPS NDBPS NCBPS NDBPS NCBPS NDBPS NCBPS NDBPS 0 100 12.5 1 100 25 48 12 22 5.5 2 100 50 48 24 22 11 12 6 3 100 75 48 36 22 16.5 12 9 4 200 100 96 48 44 22 24 12 5 200 125 96 60 44 27.5 24 15 6 96 72 44 33 24 18 8 6 7 192 96 88 44 48 24 16 8 8 192 120 88 55 48 30 16 10 9 88 66 48 36 16 12 NCBPS = number of coded bits per symbol, NDBPS = number of data bits per symbol

Table 2 illustrates alternative MCS levels where the number of data sub-carriers are integer multiples of the number of data sub-carriers for smaller size IFFTs.

TABLE 2 Alternative Modulation and Coding Schemes for 5 IFFT Sizes Number of Data Sub-Carrier (NDSC) Option 1 2 3 4 5 96 48 24 12 4 MCS NCBPS NDBPS Rate NCBPS NDBPS Rate NCBPS NDBPS Rate NCBPS NDBPS Rate NCBPS NDBPS Rate 0 24 12 93.75 1 48 24 187.5 24 12 93.75 12 6 46.88 2 96 48 375 48 24 187.5 24 12 93.75 12 6 46.88 3 96 72 562.5 48 36 281.25 24 18 140.63 12 9 70.31 4 192 96 750 96 48 375 48 24 187.5 24 12 93.75 5 192 120 937.5 96 60 468.75 48 30 234.38 24 15 117.19 6 96 72 562.5 48 36 281.25 24 18 140.63 8 6 46.88 7 192 96 750 96 48 375 48 24 187.5 16 8 62.5 8 192 120 937.5 96 60 468.75 48 30 234.38 16 10 78.13 9 96 72 562.5 48 36 281.25 16 12 93.75

The STFs and LTFs sequences discussed below have low peak-to-average power ratios (“PARs”). In addition to providing packets generated using these STFs and LTFs with low PARs: 1) ensure that the transmitter will not be clipped, therefore ensuring a good error vector magnitude (“EVM”) for the preamble and the channel estimation sequence; 2) allow for boosts to the power of the preamble without clipping; and 3) allow for better preamble range for increased robustness in the system.

OFDM is a modulation technique that can be used for the physical layer of the SUN. Some examples of complex OFDM LTF sequences are shown below. Option 1 is generated using a 128 point inverse fast Fourier transform (“IFFT”) at the Nyquist rate, Option 2 is generated using a 64 point IFFT, and Options 3, 4, and 5 are generated using 32, 16, and 8 point IFFTs, respectively.

LTF_freq(Option-1) = [0, 1, −1, 1, −1, 1, 1, −1, −1, 1, −1, 1, 1, 1, 1, −1, 1, 1, 1, 1, 1, −1, 1, −1, 1, −1, 1, −1, 1, 1, −1, 1, −1, −1, −1, 1, 1, 1, 1, 1, 1, −1, −1, −1, −1, −1, −1, 1, −1, 1, 1, −1, 1, zeros(1, 23), −1, 1, 1, −1, −1, −1, −1, 1, 1, −1, −1, 1, 1, 1, −1, −1, 1, 1, −1, −1, −1, −1, −1, 1, 1, −1, −1, −1, −1, −1, 1, 1, −1, 1, −1, −1, 1, −1, 1, 1, 1, 1, −1, −1, 1, 1, −1, 1, 1, −1, 1, 1].LTF_freq(Option-2) = [0, 1, −1, 1, 1, −1, 1, −1, −1, 1, −1, 1, 1, −1, −1, 1, 1, −1, −1, −1, −1, −1, 1, −1, −1, −1, 1, zeros(1, 11), −1, −1, −1, −1, 1, 1, 1, −1, 1, −1, 1, −1, 1, 1, −1, −1, −1, 1, 1, −1, 1, 1, 1, −1, −1, −1].LTF_freq(Option-3) = [0, −1, −1, 1, −1, 1, 1, −1, −1, 1, 1, −1, −1, 1, zeros(1, 5), 1, −1, 1, −1, 1, 1, 1, 1, 1, 1, 1, 1, −1].LTF_freq(Option-4) = [0, −1, 1, 1, 1, −1, −1, −1, 0, 1, −1, 1, 1, −1, 1, 1].  LTF_freq(Option-5) = [0, −1, 1, −1, 0, 1, 1, 1].

These sequences are given in Matlab format. For Option 5, the first 0 represents the DC tone, which is not used. The next three subcarriers are 1, 2, and 3 with data −1, 1, −1, respectively. The negative subcarriers −4, −3, −2, −1 have data 0, 1, 1, 1, respectively. In general, if there are N subcarriers, the Matlab subcarrier numbering is 0, 1, 2, 3, . . . , (N/2)−1 followed by −(N/2), . . . , −3, −2, −1.

Some examples of complex STF sequences are shown below.

STF_freq(Option-1) = sqrt(104/24) * [0, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0].STF_freq(Option-2) = sqrt(52/12) * [0, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0].STF_freq(Option-3) = sqrt(26/6) * [0, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0].STF_freq(Option-4) = sqrt(14/6) * [0, 0, −1, 0, 1, 0, −1, 0, 0, 0, 1, 0, 1, 0, 1, 0].  STF_freq(Option-5) = sqrt(6/2) * [0, 0, 0 − 1, 0, 0, 0, 1, 0].

Using these sequences, PAR can be reduced significantly as shown in the example of FIG. 1. Specifically, the first column identifies the LTF and STF sequences. The second column identifies the IFFT options used. The third column lists the PAR for communication without STFs or LTFs optimized for PAR. The fourth column lists the PAR for communication using optimized STFs and LTFs. The fifth column lists the PAR for communication using quadrature phase shift keying (“QPSK”) modulation.

Some examples of alternative LTF sequences are shown below. These sequences are given in Matlab format. For Option 5, the first 0 represents the DC tone, which is not used. The next three subcarriers are 1, 2, and 3. In general, if there are N subcarriers, the Matlab subcarrier numbering is 0, 1, 2, 3, . . . , (N/2)−1 followed by −(N/2), . . . , −3, −2, −1.

LTF Alternatives for Option 4:

$\begin{matrix} {{{Itfr}\; 4} =} & 0 & {- 1} & {- 1} & 1 & {- 1} & {- 1} & 1 & {- 1} & 0 & 1 & 1 & 1 & {- 1} & {- 1} & {- 1} & 1 \\ {{{Itfr}\; 4} =} & 0 & {- 1} & 1 & 1 & 1 & {- 1} & {- 1} & {- 1} & 0 & 1 & {- 1} & 1 & 1 & {- 1} & 1 & 1 \\ {{{Itfr}\; 4} =} & 0 & 1 & {- 1} & {- 1} & {- 1} & 1 & 1 & 1 & 0 & {- 1} & 1 & {- 1} & {- 1} & 1 & {- 1} & {- 1} \\ {{{Itfr}\; 4} =} & 0 & 1 & 1 & {- 1} & 1 & 1 & {- 1} & 1 & 0 & {- 1} & {- 1} & {- 1} & 1 & 1 & 1 & {- 1.} \end{matrix}$

LTF Alternatives for Option 5:

$\begin{matrix} {{{Itfr}\; 5} =} & 0 & {- 1} & {- 1} & {- 1} & 0 & 1 & {- 1} & 1 \\ {{{Itfr}\; 5} =} & 0 & {- 1} & 1 & {- 1} & 0 & 1 & 1 & 1 \\ {{{Itfr}\; 5} =} & 0 & 1 & {- 1} & 1 & 0 & {- 1} & {- 1} & {- 1} \\ {{{Itfr}\; 5} =} & 0 & 1 & 1 & 1 & 0 & {- 1} & 1 & {- 1} \\ {{{Itfr}\; 5} =} & 0 & {- 1} & {- 1} & {- 1} & {- 1} & 1 & 1 & {- 1} \\ {{{Itfr}\; 5} =} & 0 & {- 1} & 1 & {- 1} & 1 & 1 & {- 1} & {- 1} \\ {{{Itfr}\; 5} =} & 0 & 1 & {- 1} & 1 & {- 1} & {- 1} & 1 & 1 \\ {{{Itfr}\; 5} =} & 0 & 1 & 1 & 1 & 1 & {- 1} & {- 1} & 1. \end{matrix}$

Some examples of alternative STF sequences are shown below. These sequences are given in Matlab format. For Option 5, the first 0 represents the DC tone, which is not used. The next three subcarriers are 1, 2, and 3. In general, if there are N subcarriers, the Matlab subcarrier numbering is 0, 1, 2, 3, . . . , (N/2)−1 followed by −(N/2), . . . , −3, −2, −1.

STF Alternatives for Option 2:

$\;{{{stfr}\; 2} = \begin{matrix} 0 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 \\ 0 & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}}$ ${{stfr}\; 2} = \begin{matrix} 0 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 \\ 0 & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ ${{stfr}\; 2} = \begin{matrix} 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & 0 \\ 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ ${{stfr}\; 2} = \begin{matrix} 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 \\ 0. & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ STF Alternatives for Option 3:

${{stfr}\; 3} = \begin{matrix} 0 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ ${{stfr}\; 3} = \begin{matrix} 0 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ ${{stfr}\; 3} = \begin{matrix} 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ ${{stfr}\; 3} = \begin{matrix} 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0. & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ STF Alternatives for Option 4:

$\begin{matrix} {{{stfr}\; 4} =} & 0 & 0 & {- 1} & 0 & {- 1} & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & {- 1} & 0 & 1 & 0 \\ {{{stfr}\; 4} =} & 0 & 0 & {- 1} & 0 & 1 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 1 & 0 & 1 & 0 \\ {{{stfr}\; 4} =} & 0 & 0 & 1 & 0 & {- 1} & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & {- 1} & 0 & {- 1} & 0 \\ {{{stfr}\; 4} =} & 0 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 1 & 0 & {- 1} & 0. \end{matrix}$ STF Alternatives for Option 5:

$\begin{matrix} {{{stfr}\; 5} =} & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 \\ {{{stfr}\; 5} =} & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 \\ {{{stfr}\; 5} =} & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 \\ {{{stfr}\; 5} =} & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0. \end{matrix}$

FIG. 2 illustrates a packet format using STFs and LTFs in at least one embodiment. A synchronization header (“SHR”) comprises a STF and LTF. As illustrated, the STF and LTF are four and two symbols long respectively, but each can be any size in various embodiments. The STF allows a device to perform automatic gain control (“AGC”), packet detection, de-assertion of clear channel assessment (“CCA”) based on CCA modes (CCA Mode 1, 2, or 3), and coarse synchronization. The LTF allows a device to perform fine synchronization and perform channel estimation. The packet header (“PHR”) can be any number of data symbols or bits “M.” In at least one embodiment, the PHR contains:

-   -   A Rate field specifying the data rate of the payload frame (5         bits);     -   One reserved bit after the Rate field;     -   A Frame Length field specifying the length of the payload (11         bits);     -   Two reserved bits after the Frame Length field;     -   A Scrambler field specifying the scrambling seed (2 bits);     -   One reserved bit after the Scrambler field;     -   A Header Check Sequence (“HOS”) 8-bit CRC taken over the data         fields only; and     -   Six tail bits, which are all zeros, for Viterbi decoder         flushing.

The PHR is encoded at the lowest data rate supported for each bandwidth option in at least one embodiment. The physical layer convergence protocol service data unit (“PSDU”), which can be any number of data symbols or bits “N,” carries a media access control (“MAC”) sublayer frame, which comprises a MAC header, MAC payload, and MAC cyclic redundancy check (“CRC”) in at least one embodiment. The PSDU also carries convolutional encoder tail-bits, which can be six zeros, and pad-bits to extend the data to fill an integer number of OFDM symbols.

For OFDM, the STF and LTF fields comprise the preamble. Various embodiments for the STF and LTF for the five options are defined by FIGS. 3A-3J. These figures correspond to the Improved Complex Sequence column in FIG. 1. FIG. 3A shows the frequency domain representation of the STF for Option 1. The scaling factor used in the figure is sqrt(104/12). However, various scaling factors are used in various other embodiments, and the scaling factor can be changed to obtain a desired signal level FIG. 3B shows the frequency domain representation of the STF for Option 2. The scaling factor used in the figure is sqrt(52/12). FIG. 3C shows the frequency domain representation of the STF for Option 3. The scaling factor used in the figure is sqrt(26/6). FIG. 3D shows the frequency domain representation of the STF for Option 4. The scaling factor used in the figure is sqrt(14/6). FIG. 3E shows the frequency domain representation of the STF for Option 5. The scaling factor used in the figure is sqrt(6/2).

LTFs for the five scalable bandwidth OFDM options are defined in FIGS. 3F-3J. FIG. 3F shows the frequency domain representation of the LTF for Option 1. FIG. 3G shows the frequency domain representation of the LTF for Option 2. Similarly, FIGS. 3H-I show the frequency domain representations of the LTFs for Options 3-5.

FIG. 4 illustrates modules 400 or logic in a device for receiving, generating, and transmitting the STFs and LTFs. The device sends and receives packets in a WPAN as part of a SUN in at least one embodiment. The device preferably comprises a processor, an antenna coupled to the processor, and memory coupled to the processor. At 402, packets are received, and the packets contain data symbols that may be binary phase shift keyed (“BPSK”) (−1−j and 1+j), rotated BPSK (−1 and 1), QPSK (−1−j, −1+j, 1−j, and 1+j), or rotated QPSK (−1, 1, −j, and j).

At 404, conjugate symmetry may be applied to the symbols in the frequency domain, thus producing a real signal in the time domain (i.e. no complex portion to the signal). At a transmitter, this real sequence only requires one digital to analog converter (“DAC”) because there is no complex portion to be processed. DCM can also be used for the header to provide frequency diversity. In an alternative embodiment, a complex module or logic is turned off or run at reduced power, and the total power necessary to operate the device is reduced. In an alternative embodiment, the conjugate symmetry may be omitted so that a complex STF and LTF is produced.

At 406, the IFFT converts the symbols to a time domain sequence. In at least one embodiment, the STF and LTF can be generated offline using the IFFT to form time domain sequences, and these can be stored and used in the device. The Time-Domain STF for Option-n (n=1, 2, 3, 4, 5) is obtained as follows: STF_time(Option-n)=IFFT(STF_freq(Option-n)).

The time-domain STF is repeated to fill four OFDM symbols with the last ¼ symbol repetition negated before transmission in at least one embodiment. In other embodiments, the size of the STF and the size of the negated portion vary.

The Time-Domain LTF for Option-n (n=1, 2, 3, 4, 5) is obtained as follows: LTF_time(Option-n)=IFFT(LTF_freq(Option-n)).

In at least one embodiment, the time-domain LTF is repeated to fill two OFDM symbols before transmission. In other embodiments, the size of the LTF varies.

At 408, frequency domain interpolation is performed by inserting extra zeros after the positive sub-carriers. Alternatively, a time-domain interpolator can be used to generate an oversampled signal at a transmitter. The interpolation is part of the IFFT in at least one embodiment. At 410, a DAC converts signals from digital to analog in preparation for transmittal. In another embodiment, as shown in FIG. 5, the last repetition in the STF is negated at 507. Specifically, the STF comprises a group of bits that are repeated. In such an embodiment, the last group of bits is negated.

The receiving device implements a correlator to search for the preamble in at least one embodiment. The correlation is performed using the known transmitted preamble at the device. In another embodiment, the device performs a delayed correlation by storing the received signal in memory, and correlating a delayed version of the preamble with a non-delayed version. For example, if the preamble repeats every 128 samples, then the delay can be set to 128 samples. In addition, the phase rotation at the peak correlation provides an estimate of the carrier-frequency offset.

For each of the 5 options, both a short and long training field can be defined. For Option 5 with an IFFT size of 8, the STF can be defined in the frequency domain as:

[0 0 −1 0 0 0 −1 0].

The corresponding sub-carriers are given below.

DC 1 2 3 −4 −3 −2 −1.

Applying the IFFT results in:

[−0.2500 0 0.2500 0 −0.2500 0 0.2500 0].

At the transmitter, interpolation occurs to at least four times the sample rate in at least one embodiment. This interpolation can occur as part of the IFFT or after the IFFT. For example, 24 zeros are inserted after the highest positive frequency before taking the IFFT as shown below.

4*IFFT([0 0 −1 0 zeros(1,24) 0 0 −1 0]=[−0.2500 −0.2310−0.1768 −0.0957 0 0.0957 0.1768 0.2310 0.2500 0.2310 0.1768 0.0957 0 −0.0957 −0.1768 −0.2310 −0.2500 −0.2310 −0.1768 −0.0957 0 0.0957 0.1768 0.2310 0.2500 0.2310 0.1768 0.0957 0 −0.0957 −0.1768 −0.2310].

These sequences are given in Matlab format. For Option 5, the first 0 represents the DC tone, which is not used. The next three subcarriers are 1, 2, and 3. In general, if there are N subcarriers, the Matlab subcarrier numbering is 0, 1, 2, 3, . . . , (N/2)−1 followed by −(N/2), . . . , −3, −2, −1. For Option 5 with an IFFT size of 8, the STF can be defined in the frequency domain as:

Option  5:  PAR = 3.0103  dB $\begin{matrix} \left\lbrack 0 \right. & 0 & {- 1} & 0 & 0 & 0 & {- 1} & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & 1 & 0 & 0 & 0 & 1 & {\left. 0 \right\rbrack.} \end{matrix}$

For Option 4, the STF can be defined in the frequency domain as:

Option  4:  PAR = 4.3983  dB $\begin{matrix} \left\lbrack 0 \right. & 0 & {- 1} & 0 & {- 1} & 0 & 1 & 0 & 0 & 0 & 1 & 0 & {- 1} & 0 & {- 1} & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & {- 1} & 0 & 1 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 1 & 0 & {- 1} & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & 1 & 0 & {- 1} & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & {- 1} & 0 & 1 & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & 1 & 0 & 1 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 1 & 0 & 1 & {\left. 0 \right\rbrack.} \end{matrix}$

For Option 3, the STF can be defined in the frequency domain as:

$\begin{matrix} {{{Option}\mspace{14mu} 3\text{:}\mspace{14mu}{PAR}} = {4.3983\mspace{14mu}{dB}}} & \; \\ \begin{matrix} \left\lbrack 0 \right. & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \left\lbrack 0 \right. & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \left\lbrack 0 \right. & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \left\lbrack 0 \right. & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & {\left. 0 \right\rbrack.} & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix} & \; \end{matrix}$

For Option 2, the STF can be defined in the frequency domain as:

$\begin{matrix} {{{Option}\mspace{14mu} 2\text{:}\mspace{14mu}{PAR}} = {5.0685\mspace{14mu}{dB}}} & \; \\ \begin{matrix} \left\lbrack 0 \right. & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 \\ \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \left\lbrack 0 \right. & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 \\ \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \left\lbrack 0 \right. & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 \\ \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \left\lbrack 0 \right. & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & 0 \\ 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 \\ {\left. 0 \right\rbrack.} & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix} & \; \end{matrix}$

These sequences are given in Matlab format. For Option 5, the first 0 represents the DC tone, which is not used. The next three subcarriers are 1, 2, and 3. In general, if there are N subcarriers, the Matlab subcarrier numbering is 0, 1, 2, 3, . . . , (N/2)−1 followed by −(N/2), . . . , −3, −2, −1. For Option 1, the STF can be defined in the frequency domain as:

Option  1:  PAR = 4.4012  dB $\begin{matrix} \left\lbrack 0 \right. & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 \\ 0 & \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ $\begin{matrix} \left\lbrack 0 \right. & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 \\ 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 \\ 0 & \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ $\begin{matrix} \left\lbrack 0 \right. & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 \\ 0 & \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ $\begin{matrix} \left\lbrack 0 \right. & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 \\ 0 & 0 & {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 \\ {- 1} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 \\ 0 & {\left. 0 \right\rbrack.} & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$

In at least one embodiment, the STF can be designed using rotated QPSK symbols. In another embodiment, the STF can be designed using rotated BPSK symbols. By having freedom in the design of the sequences, the PAR can be lowered for Option 1 and 2 easily on a case-by-case basis.

These sequences are given in Matlab format. For Option 5, the first 0 represents the DC tone, which is not used. The next three subcarriers are 1, 2, and 3. In general, if there are N subcarriers, the Matlab subcarrier numbering is 0, 1, 2, 3, . . . , (N/2)−1 followed by −(N/2), . . . , −3, −2, −1. An example of STFs using QPSK are:

Option  5:  PAR = 3.0103  dB $\begin{matrix} \left\lbrack 0 \right. & 0 & {- j} & 0 & 0 & 0 & j & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & j & 0 & 0 & 0 & {- j} & {\left. 0 \right\rbrack;} \end{matrix}$ Option  4:  PAR = 4.3983  dB In addition to the 4 sequences for BPSK,

$\begin{matrix} \begin{matrix} \begin{matrix} \left\lbrack 0 \right. & 0 & {- j} & 0 & {- 1} & 0 & {- j} & 0 & 0 & 0 & j & 0 & {- 1} & 0 & j & {\left. 0 \right\rbrack\mspace{571mu}} \\ \left\lbrack 0 \right. & 0 & {- j} & 0 & 1 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 1 & 0 & j & {\left. 0 \right\rbrack\mspace{574mu}} \\ \left\lbrack 0 \right. & 0 & j & 0 & {- 1} & 0 & j & 0 & 0 & 0 & {- j} & 0 & {- 1} & 0 & {- j} & {\left. 0 \right\rbrack\mspace{574mu}} \\ \left\lbrack 0 \right. & 0 & j & 0 & 1 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 1 & 0 & {- j} & {{\left. 0 \right\rbrack;}\mspace{571mu}} \end{matrix} \\ {{{{Option}\mspace{14mu} 3\text{:}\mspace{14mu}{PAR}} = {4.3983\mspace{14mu}{dB}}}\mspace{889mu}} \\ {\begin{matrix} \left\lbrack 0 \right. & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & j & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 \\ \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \left\lbrack 0 \right. & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & j & 0 & 0 & 0 & 1 & 0 & 0 & 0 & j & 0 & 0 \\ \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \left\lbrack 0 \right. & 0 & 0 & 0 & j & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- j} & 0 & 0 \\ \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \left\lbrack 0 \right. & 0 & 0 & 0 & j & 0 & 0 & 0 & 1 & 0 & 0 & 0 & j & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 & 0 \\ {\left. 0 \right\rbrack;} & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}\mspace{59mu}} \\ {{{{Option}\mspace{14mu} 2\text{:}\mspace{14mu}{PAR}} = {4.2346\mspace{14mu}{dB}}}\mspace{905mu}} \end{matrix} \\ \begin{matrix} \left\lbrack 0 \right. & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & j & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & j & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & j & 0 & 0 & 0 & {- 1} & 0 & 0 & \; \\ \left. 0 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \left\lbrack 0 \right. & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & j & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 1 & 0 & 0 & 0 & j & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- 1} & 0 & 0 & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & j & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 & 0 & 1 & 0 & 0 & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & 0 & 0 & 1 & 0 & 0 & 0 & j & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 1 & 0 & 0 & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & \left. 0 \right\rbrack \\ \left\lbrack 0 \right. & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & {\left. 0 \right\rbrack;} \end{matrix} \\ {{and}} \\ {{{{Option}\mspace{14mu} 1\text{:}\mspace{14mu}{PAR}} = {3.7261\mspace{14mu}{dB}}}} \\ \begin{matrix} \left\lbrack 0 \right. & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 \\ {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 \\ j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & {- j} & 0 & 0 & 0 & j & 0 & 0 & 0 & j & 0 & 0 & 0 & {- j} & 0 & 0 & {\left. 0 \right\rbrack.} \end{matrix} \end{matrix}$

These sequences are given in Matlab format. For Option 5, the first 0 represents the DC tone, which is not used. The next three subcarriers are 1, 2, and 3. In general, if there are N subcarriers, the Matlab subcarrier numbering is 0, 1, 2, 3, . . . , (N/2)−1 followed by −(N/2), . . . , −3, −2, −1. Some examples of LTFs using a rotated BPSK are:

${{{Option}\mspace{14mu} 5\text{:}\mspace{14mu}{PAR}} = {4.3983\mspace{14mu}{{{{{dB}\begin{bmatrix} 0 & {- 1} & {- 1} & 1 & 0 & 1 & {- 1} & {- 1} \end{bmatrix}}\begin{bmatrix} 0 & {- 1} & 1 & 1 & 0 & 1 & 1 & {- 1} \end{bmatrix}}\begin{bmatrix} 0 & 1 & {- 1} & {- 1} & 0 & {- 1} & {- 1} & 1 \end{bmatrix}}\begin{bmatrix} 0 & 1 & 1 & {- 1} & 0 & {- 1} & 1 & 1 \end{bmatrix}}}};$ Option  4:  PAR = 4.1017  dB $\begin{matrix} \left\lbrack 0 \right. & {- 1} & {- 1} & {- 1} & 1 & 1 & {- 1} & 1 & 0 & 1 & {- 1} & 1 & 1 & {- 1} & {- 1} & \left. {- 1} \right\rbrack \\ \left\lbrack 0 \right. & {- 1} & 1 & {- 1} & {- 1} & 1 & 1 & 1 & 0 & 1 & 1 & 1 & {- 1} & {- 1} & 1 & \left. {- 1} \right\rbrack \\ \left\lbrack 0 \right. & 1 & {- 1} & 1 & 1 & {- 1} & {- 1} & {- 1} & 0 & {- 1} & {- 1} & {- 1} & 1 & 1 & {- 1} & \left. 1 \right\rbrack \\ \left\lbrack 0 \right. & 1 & 1 & 1 & {- 1} & {- 1} & 1 & {- 1} & 0 & {- 1} & 1 & {- 1} & {- 1} & 1 & 1 & {\left. 1 \right\rbrack;} \end{matrix}$ Option  3 : PAR = 4.1538  dB $\begin{matrix} \left\lbrack 0 \right. & {- 1} & {- 1} & {- 1} & {- 1} & {- 1} & 1 & {- 1} & 1 & 1 & 1 & {- 1} & {- 1} & 1 & 0 & 0 & 0 & 0 & 0 & 1 \\ {- 1} & {- 1} & 1 & 1 & 1 & {- 1} & 1 & {- 1} & {- 1} & {- 1} & {- 1} & \left. {- 1} \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ $\begin{matrix} \left\lbrack 0 \right. & {- 1} & 1 & {- 1} & 1 & {- 1} & {- 1} & {- 1} & {- 1} & 1 & {- 1} & {- 1} & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 1 \\ 1 & {- 1} & {- 1} & 1 & {- 1} & {- 1} & {- 1} & {- 1} & 1 & {- 1} & 1 & \left. {- 1} \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ $\begin{matrix} \left\lbrack 0 \right. & 1 & {- 1} & 1 & {- 1} & 1 & 1 & 1 & 1 & {- 1} & 1 & 1 & {- 1} & {- 1} & 0 & 0 & 0 & 0 & 0 & {- 1} \\ {- 1} & 1 & 1 & {- 1} & 1 & 1 & 1 & 1 & {- 1} & 1 & {- 1} & \left. 1 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ $\begin{matrix} \left\lbrack 0 \right. & 1 & 1 & 1 & 1 & 1 & {- 1} & 1 & {- 1} & {- 1} & {- 1} & 1 & 1 & {- 1} & 0 & 0 & 0 & 0 & 0 & {- 1} \\ 1 & 1 & {- 1} & {- 1} & {- 1} & 1 & {- 1} & 1 & 1 & 1 & 1 & {\left. 1 \right\rbrack;} & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ Option  2:  PAR = 4.4236  dB $\begin{matrix} 0 & {- 1} & {- 1} & {- 1} & {- 1} & 1 & {- 1} & 1 & {- 1} & 1 & 1 & {- 1} & 1 & 1 & {- 1} & {- 1} & 1 & {- 1} & {- 1} & {- 1} & \; \\ 1 & 1 & 1 & {- 1} & {- 1} & {- 1} & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & {- 1} & {- 1} \end{matrix}$ $\begin{matrix} {- 1} & 1 & 1 & 1 & {- 1} & {- 1} & {- 1} & 1 & {- 1} & {- 1} & 1 & 1 & {- 1} & 1 & 1 & {- 1} & 1 & {- 1} & 1 & {- 1} & {- \;} \\ {- 1} & {- 1} & {\left. {- 1} \right\rbrack;{and}} & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ Option  1(100  data  sub-carriers):  PAR = 5.0478  dB $\begin{matrix} \left\lbrack 0 \right. & 1 & 1 & {- 1} & {- 1} & 1 & 1 & {- 1} & 1 & 1 & 1 & {- 1} & 1 & 1 & {- 1} & 1 & {- 1} & 1 & {- 1} & {- 1} & - \\ 1 & {- 1} & {- 1} & 1 & 1 & 1 & 1 & {- 1} & {- 1} & {- 1} & 1 & {- 1} & 1 & {- 1} & {- 1} & 1 & 1 & 1 & 1 & {- 1} & -  \end{matrix}$ $\begin{matrix} 1 & {- 1} & 1 & {- 1} & {- 1} & {- 1} & 1 & {- 1} & {- 1} & {- 1} & {- 1} & 1 & 1 & {- 1} & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & {- 1} & 1 & 1 & {- 1} & {- 1} & {- 1} & {- 1} \end{matrix}$ $\begin{matrix} 1 & {- 1} & {- 1} & {- 1} & 1 & {- 1} & {- 1} & {- 1} & 1 & 1 & 1 & 1 & {- 1} & {- 1} & 1 & {- 1} & 1 & {- 1} & {- 1} & {- 1} & \; \\ 1 & 1 & 1 & 1 & {- 1} & {- 1} & {- 1} & {- 1} & {- 1} & 1 & {- 1} & 1 & {- 1} & 1 & 1 & {- 1} & 1 & 1 & 1 & {- 1} & 1 \end{matrix}$ $\begin{matrix} 1 & {- 1} & {- 1} & 1 & \left. 1 \right\rbrack & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \end{matrix}$ Option  1(96  data  sub-carriers) : PAR = 5.2695  dB $\begin{matrix} \left\lbrack 0 \right. & 1 & {- 1} & {- 1} & 1 & 1 & {- 1} & {- 1} & 1 & 1 & {- 1} & 1 & 1 & 1 & 1 & {- 1} & 1 & {- 1} & {- 1} & {- 1} & - \\ 1 & {- 1} & {- 1} & 1 & 1 & 1 & 1 & 1 & {- 1} & {- 1} & 1 & {- 1} & 1 & 1 & 1 & {- 1} & {- 1} & {- 1} & {- 1} & 1 & 1 \end{matrix}$ $\begin{matrix} {- 1} & {- 1} & {- 1} & {- 1} & 1 & {- 1} & {- 1} & {- 1} & {- 1} & 1 & {- 1} & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \; \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & {- 1} & 1 & {- 1} & {- 1} & {- 1} \end{matrix}$ $\begin{matrix} {- 1} & 1 & {- 1} & {- 1} & {- 1} & {- 1} & 1 & 1 & {- 1} & {- 1} & {- 1} & {- 1} & 1 & 1 & 1 & {- 1} & 1 & {- 1} & {- 1} & 1 & \; \\ 1 & 1 & 1 & 1 & {- 1} & {- 1} & {- 1} & {- 1} & {- 1} & {- 1} & 1 & {- 1} & 1 & 1 & 1 & 1 & {- 1} & 1 & 1 & {- 1} & -  \end{matrix}$ $\begin{matrix} 1 & 1 & 1 & {- 1} & {- 1} & {\left. 1 \right\rbrack.} \end{matrix}$

In at least one embodiment, a scaling factor is included to match the energy in the STF to the energy in the data symbols. For option 5, the STF can be scaled by sqrt(6/2) if there are 6 pilot+ data subcarriers used for the data OFDM symbols while two sub-carriers are used for STF. Alternatively, the sub-carriers are scaled down in the data OFDM symbols to match the energy in the STF. Some examples of STFs including scaling factors are: STF_freq(Option-1)=sqrt(104/24)*[0,zeros(1,3),j,zeros(1,3),−j,zeros(1,3),j,zeros(1,3),j,zeros(1,3),j,zeros(1,3),−j,zeros(1,3),j,zeros(1,3),−j,zeros(1,3),j,zeros(1,3),j,zeros(1,3),j,zeros(1,3),j,zeros(1,3),−j,zeros(1,3),−j,zeros(1,3),−j,zeros(1,3),−j,zeros(1,3),j,zeros(1,3),−j,zeros(1,3),j,zeros(1,3),−j,zeros(1,3),−j,zeros(1,3),j,zeros(1,3),j,zeros(1,3),−j,zeros(1,3)]; STF_freq(Option-2)=sqrt(52/12)*[0,zeros(1,3),−1,zeros(1,3),−j,zeros(1,3),1,zeros(1,3),j,zeros(1,3),1,zeros(1,3),−j,zeros(1,15),j,zeros(1,3),1,zeros(1,3),−j,zeros(1,3),1,zeros(1,3),j,zeros(1,3),−1,zeros(1,3)]; STF_freq(Option-3)=sqrt(26/6)*[0,zeros(1,3),−j,zeros(1,3),−1,zeros(1,3),−j,zeros(1,3),0,zeros(1,3),j,zeros(1,3),−1,zeros(1,3),j,zeros(1,3)]; STF_freq(Option-4)=sqrt(14/6)*[0,0,j,0,1,0,−j,0,0,0,j,0,−1,0,j,0]; and STF_freq(Option-5)=sqrt(6/2)*[0,0,−j,0,0,0,j,0].

These sequences are given in Matlab format. For Option 5, the first 0 represents the DC tone, which is not used. The next three subcarriers are 1, 2, and 3. In general, if there are N subcarriers, the Matlab subcarrier numbering is 0, 1, 2, 3, . . . , (N/2)−1 followed by −(N/2), . . . , −3, −2, −1. Some examples of LTFs are: LTF_freq(Option-1)=[0,1,−1,−1,1,1,−1,−1,1,1,−1,1,1,1,1,−1,1,−1,−1,−1,−1,−1,−1,1,1,1,1,1,−1,−1,1,−1,1,1,1,−1,−1,−1,−1,1,1,−1,−1,−1,−1,1,−1,−1,−1,−1,1,−1,−1,zeros(1,23),−1,−1,1,−1,−1,−1,−1,1,−1,−1,−1,−1,1,1,−1,−1,−1,−1,1,1,1,−1,1,−1,−1,1,1,1,1,1,−1,−1,−1,−1,−1,−1,1,−1,1,1,1,1,−1,1,1,−1,−1,1,1,−1,−1,1]; LTF_freq(Option-2)=[0,−1,−1,−1,−1,1,−1,1,−1,1,1,−1,1,1,−1,−1,1,−1,−1,−1,1,1,1,−1,−1,−1,−1,zeros(1,11),−1,−1,−1,−1,1,1,1,−1,−1,−1,1,−1,−1,1,1,−1,1,1,−1,1,−1,1,−1,−1,−1,−1]; LTF_freq(Option-3)=[0,−1,−1,−1,−1,−1,1,−1,1,1,1,−1,−1,1,zeros(1,5),1,−1,−1,1,1,1,−1,1,−1,−1,1,−1,−1]; LTF_freq(Option-4)=[0,−1,−1,−1,1,1,−1,1,zeros(1,1),1,−1,1,1,−1,−1,−1]; and LTF_freq(Option-5)=[0,−1,−1,1,zeros(1,1),1,−1,−1].

An alternative example of a LTF using 100 data sub-carriers is: LTE_freq(Option-1 alternative)=[0,1,1,−1,−1,1,1,−1,1,1,1,−1,1,1,−1,1,−1,1,−1,−1,−1,−1,−1,1,1,1,1,−1,−1,−1,1,−1,1,−1,−1,1,1,1,1,−1,−1,−1,1,−1,−1,−1,1,−1,−1,−1,−1,1,1,−1,1,zeros(1,19),1,−1,1,1,−1,−1,−1,−1,1,−1,−1,−1,1,−1,−1,−1,1,1,1,1,−1,−1,1,−1,1,−1,−1,−1,1,1,1,1,−1,−1,−1,−1,−1,1,−1,1,−1,1,1,−1,1,1,1,−1,1,1,−1,−1,1,1].

In some embodiments, the preamble can be constructed to enable efficient boundary detection of the start of the OFDM packet. For example, FIG. 6 shows that a negation is applied for the last repetition in the STF. In at least one embodiment, the last repetition of a group of bits in the final STF is negated at the transmitter, and the receiver can use this information to determine when the sign change takes place so that the end of the STF can be determined accurately. Specifically, the output of a correlator shows a characteristic pattern at the boundary of the STF and LTF. In various embodiments, the last 2, 3, or N repetitions are negated. When cross-correlation is used (correlating against a known sequence), the transition that occurs from z to −z can be found by monitoring for a phase change of 180 degrees (in the noiseless case) in the correlator output. In FIG. 6, the “z” represents one group of bits repeated in the STF, which is itself repeated. In another embodiment, the entire final repeated STF is negated. In other embodiments, the size of the bits that are negated varies. Returning to FIG. 6, there are two OFDM symbols because the cyclic prefix is ¼ of the useful part of the OFDM symbol, and there is a repetition of 4 within the OFDM symbol due to the structure of the STF. Because the time-domain representation of the STF is real, any negative time-domain values for the last repetition are changed to positive and any positive time-domain values are changed to negative. In another embodiment the STF is complex, so the both the real and imaginary parts are negated for the last repetition within the last STF.

FIG. 7 illustrates a method of generating STFs and LTFs beginning at 702 and ending at 714. While at least one embodiment is illustrated, the method 700 can comprise any step described above in various embodiments. At 704, a first plurality of symbols comprising real portions and complex portions is received. At 706, conjugate symmetry is applied to the first plurality of symbols, thus producing a second plurality of symbols comprising real portions and no complex portions. At 708, the second plurality of symbols is transformed using an inverse fast Fourier transform, thus producing a third plurality of symbols. In at least one embodiment, the second plurality of symbols is interpolated. At 710, a short training field is generated comprising at least one real portion of the third plurality of symbols. At 712, a long training field is generated comprising at least one real portion of the third plurality of symbols. At 714, the short training field and long training field are transmitted in a wireless personal area network. In at least one embodiment, power is reduced to logic responsible for complex symbol processing. A final repetition of a group of bits is negated in at least one embodiment. Preferably, the last portion of the STF is negated. In an alternative embodiment the block 706 is omitted so that the STF and LTF are complex.

The system described above may be implemented on a particular machine with sufficient processing power, memory resources, and network throughput capability to handle the necessary workload placed upon it. FIG. 8 illustrates a particular machine 880 suitable for implementing one or more embodiments disclosed herein. The computer system 880 includes one or more processors 882 (which may be referred to as a central processor unit or CPU) that is in communication with a machine-readable medium 887. The machine-readable medium 887 may comprise memory devices including secondary storage 884, read only memory (ROM) 886, and random access memory (RAM) 888. The processor is further in communication with input/output (I/O) 890 devices and network connectivity devices 892. The processor may be implemented as one or more CPU chips.

The secondary storage 884 is typically comprised of one or more disk drives, tape drives, or optical discs and is used for non-volatile storage of data and as an over-flow data storage device if RAM 888 is not large enough to hold all working data. Secondary storage 884 may be used to store programs and instructions 889 that are loaded into RAM 888 when such programs are selected for execution. The ROM 886 is used to store instructions 889 and perhaps data, which are read during program execution. ROM 886 is a non-volatile memory device that typically has a small memory capacity relative to the larger memory capacity of secondary storage. The RAM 888 is used to store volatile data and perhaps to store instructions 889. Access to both ROM 886 and RAM 888 is typically faster than to secondary storage 884.

I/O 890 devices may include printers, video monitors, liquid crystal displays (LCDs), touch screen displays, keyboards, keypads, switches, dials, mice, track balls, voice recognizers, card readers, paper tape readers, or other well-known input devices. The network connectivity devices 892 may take the form of modems, modem banks, ethernet cards, universal serial bus (USB) interface cards, serial interfaces, token ring cards, fiber distributed data interface (FDDI) cards, wireless local area network (WLAN) cards, radio transceiver cards such as code division multiple access (CDMA) and/or global system for mobile communications (GSM) radio transceiver cards, and other well-known network devices. These network connectivity 892 devices may enable the processor 882 to communicate with an Internet or one or more intranets. With such a network connection, the processor 882 may receive information from the network, or may output information to the network in the course of performing the above-described method steps. Such information, which is often represented as a sequence of instructions 889 to be executed using processor 882, may be received from and output to the network, for example, in the form of a computer data signal embodied in a carrier wave

Such information, which may include data or instructions 889 to be executed using processor 882 for example, may be received from and output to the network, for example, in the form of a computer data baseband signal or signal embodied in a carrier wave. The baseband signal or signal embodied in the carrier wave generated by the network connectivity 892 devices may propagate in or on the surface of electrical conductors, in coaxial cables, in waveguides, in optical media, for example optical fiber, or in the air or free space. The information contained in the baseband signal or signal embedded in the carrier wave may be ordered according to different sequences, as may be desirable for either processing or generating the information or transmitting or receiving the information. The baseband signal or signal embedded in the carrier wave, or other types of signals currently used or hereafter developed, referred to herein as the transmission medium, may be generated according to several methods well known to one skilled in the art.

The processor 882 executes instructions 889, codes, computer programs, scripts which it accesses from hard disk, floppy disk, optical disc (these various disk based systems may all be considered secondary storage 884), ROM 886, RAM 888, or the network connectivity devices 892.

In an alternative embodiment the system may be implemented in an application specific integrated circuit (“ASIC”) comprising logic configured to perform any action described in this disclosure with corresponding and appropriate inputs and outputs or a digital signal processor (“DSP”).

The above disclosure is meant to be illustrative of the principles and various embodiment of the present invention. Numerous variations and modifications will become apparent to those skilled in the art once the above disclosure is fully appreciated. Additionally, audio or visual alerts may be triggered upon successful completion of any action described herein, upon unsuccessful actions described herein, and upon errors. Also, the order of the actions shown in FIG. 7 can be varied from order shown, and two or more of the actions may be performed concurrently. It is intended that the following claims be interpreted to embrace all variations and modifications. 

What is claimed is:
 1. An integrated circuit, comprising logic configured to: receive a first plurality of symbols comprising real portions and complex portions; apply conjugate symmetry to the first plurality of symbols, producing a second plurality of symbols comprising no complex portions; transform the second plurality of symbols using an inverse fast Fourier transform, producing a third plurality of symbols; generate a short training field comprising at least one real portion of the third plurality of symbols; negate one or more repetitions of a group of bits in the short training field, generate a packet comprising wherein the short training field is part of a synchronization header and a long training field as part of the synchronization header; and use the packet for communication in a wireless network.
 2. The integrated circuit of claim 1, wherein the long training field comprises values [0, −1, −1, 1, −1, 1, 1, −1, −1, 1, 1, −1, −1, 1, 0, 0, 0, 0, 0, 1, −1, 1, −1, 1, 1, 1, 1, 1, 1, 1, 1, −1] for tones [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,11, 12, 13, 14, 15, −16, −15, −14, −13, −12, −11, −10, −9, −8, −7, −6, −5, −4, −3, −2, −1], respectively, wherein the values of 1 or −1 are adjustable based on a scaling factor.
 3. The integrated circuit of claim 1, wherein the short training field comprises a complex portion, wherein the long training field comprises a complex portion, wherein the short training field has a peak-to-average power ratio below 2.248 dB.
 4. The integrated circuit of claim 1, comprising logic configured to negate one or more final repetitions of a group of bits in the short training field.
 5. The integrated circuit of claim 1, wherein the short training field comprises a complex portion, wherein the long training field comprises a complex portion, wherein the long training field has a peak-to-average power ratio below 3.17 dB.
 6. The integrated circuit of claim 1, wherein the short training field comprises values [0, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0] for tones [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,11, 12, 13, 14, 15, −16, −15, −14, −13, −12, −11, −10, −9, −8, −7, −6, −5, −4, −3, −2, −1], respectively, wherein the values of 1 or −1 are adjustable based on a scaling factor.
 7. An integrated circuit, comprising logic configured to: receive a packet comprising a short training field as part of a synchronization header and a long training field as part of the synchronization header; use the packet for communication in a wireless network, wherein the packet was generated from: a first plurality of symbols comprising real portions and complex portions; conjugate symmetry applied to the first plurality of symbols, producing a second plurality of symbols comprising no complex portions; the second plurality of symbols transformed using an inverse fast Fourier transform, producing a third plurality of symbols; the short training field generated comprising at least one real portion of the third plurality of symbols; and one or more repetitions of a group of bits in the short training field negated.
 8. The integrated circuit of claim 7, wherein automatic gain control calculations are based on the short training field.
 9. The integrated circuit of claim 7, wherein boundary detection is based on the short training field.
 10. The integrated circuit of claim 7, wherein coarse frequency offset estimation is based on the short training field, and wherein fine frequency offset estimation is based on the long training field.
 11. The integrated circuit of claim 7, wherein integer frequency offset estimation is based on the long training field.
 12. The integrated circuit of claim 7, wherein fast Fourier transform placement is based on the long training field.
 13. The integrated circuit of claim 7, wherein channel estimation is based on the long training field.
 14. A device, comprising: a processor; a memory coupled to the processor, wherein the processor is configured to; receive a first plurality of symbols comprising real portions and complex portions; apply conjugate symmetry to the first plurality of symbols, producing a second plurality of symbols comprising no complex portions; transform the second plurality of symbols using an inverse fast Fourier transform, producing a third plurality of symbols; generate a short training field comprising at least one real portion of the third plurality of symbols; negate one or more repetitions of a group of bits in the short training field, wherein the processor generates a packet comprising the short training field as part of a synchronization header and a long training field as part of the synchronization header; wherein the device uses the packet for communication in a wireless network.
 15. The device of claim 14, wherein the short training field comprises a complex portion, wherein the long training field comprises a complex portion, wherein the long training field has a peak-to-average power ratio below 3.17 dB.
 16. The device of claim 14, wherein the long training field comprises values [0, −1, −1, 1, −1, 1, 1, −1, −1, 1, 1, −1, −1, 1, 0, 0, 0, 0, 0, 1, −1, 1, −1, 1, 1, 1, 1, 1, 1, 1, 1, −1] for tones [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,11, 12, 13, 14, 15, −16, −15, −14, −13, −12, −11, −10, −9, −8, −7, −6, −5, −4, −3, −2, −1], respectively, wherein the values of 1 or −1 are adjustable based on a scaling factor.
 17. The device of claim 14, wherein the short training field comprises values [0, 0, 0, 0, −1, 0, 0, 0, 1, 0, 0, 0, −1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0] for tones [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,11, 12, 13, 14, 15, −16, −15, −14, −13, −12, −11, −10, −9, −8, −7, −6, −5, −4, −3, −2, −1], respectively, wherein the values of 1 or −1 are adjustable based on a scaling factor.
 18. The device of claim 14, wherein the short training field comprises and a complex portion, wherein the long training field comprises a complex portion, wherein the short training field has a peak-to-average power ratio below 2.248 dB.
 19. A non-transitory machine-readable storage medium comprising executable instructions that, when executed, cause one or more processors to: receive a first plurality of symbols comprising real portions and complex portions; apply conjugate symmetry to the first plurality of symbols, producing a second plurality of symbols comprising no complex portions; transform the second plurality of symbols using an inverse fast Fourier transform, producing a third plurality of symbols; generate a short training field comprising at least one real portion of the third plurality of symbols; negate one or more repetitions of a group of bits in the short training field wherein the one or more processors are further caused to generate a long training field comprising at least one real portion of the third plurality of symbols; transmit the short training field and long training field in a wireless network. 